Iterations of quadratic polynomials over finite fields

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On permutation polynomials over finite fields: differences and iterations

The Carlitz rank of a permutation polynomial f over a finite field Fq is a simple concept that was introduced in the last decade. Classifying permutations over Fq

متن کامل

Irreducible Polynomials over Finite Fields

As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...

متن کامل

Settled Polynomials over Finite Fields

We study the factorization into irreducibles of iterates of a quadratic polynomial f over a finite field. We call f settled when the factorization of its nth iterate for large n is dominated by “stable” polynomials, namely those that are irreducible under post-composition by any iterate of f . We prove that stable polynomials may be detected by their action on the critical orbit of f , and that...

متن کامل

Preperiodic points for quadratic polynomials over quadratic fields

To each quadratic number field K and each quadratic polynomial f with K-coefficients, one can associate a finite directed graph G(f,K) whose vertices are the K-rational preperiodic points for f , and whose edges reflect the action of f on these points. This paper has two main goals. (1) For an abstract directed graph G, classify the pairs (K, f) such that the isomorphism class of G is realized ...

متن کامل

Pairs of Quadratic Forms over Finite Fields

Let Fq be a finite field with q elements and let X be a set of matrices over Fq. The main results of this paper are explicit expressions for the number of pairs (A,B) of matrices in X such that A has rank r, B has rank s, and A + B has rank k in the cases that (i) X is the set of alternating matrices over Fq and (ii) X is the set of symmetric matrices over Fq for odd q. Our motivation to study ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Involve, a Journal of Mathematics

سال: 2013

ISSN: 1944-4184,1944-4176

DOI: 10.2140/involve.2013.6.99